Generation of Ship’s Passage Plan Using Data-Driven Shortest Path Algorithms

In this study, an approach for generating the shortest-distance passage plan a ship is proposed considering navigable area obtained based on automatic identification system data. The designated information from electronic navigational chart and by traffic density using Jenks natural breaks classification. shortest-path algorithms used in our experiment are Dijkstra, A*, improved A*. Then, Douglas–Peucker algorithm applied to generate optimal result supplementing generated best-performing algorithm. was divided into two cases depending whether or not covered target of namely, vessel service control Busan Port between New Ulsan Port. A* performed better than Dijkstra these cases. Subsequently, distance final 98.649 km case passing through 105.365 bypassing, which were less distances actual approximately 13.18% 7.27%, respectively. experimental results show possibility automatically establishing area. addition, study suggests effective coastal navigation, more complex ocean navigation. Further, can serve as basis plans maritime autonomous surface ships.